Online Surrogate Problem Methodology for Stochastic Discrete Resource Allocation Problems

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An On-line ‘surrogate Problem’ Methodology for Stochastic Discrete Resource Allocation Problems∗

We consider stochastic discrete optimization problems where the decision variables are non-negative integers. We propose and analyze an on-line control scheme which transforms the problem into a “surrogate” continuous optimization problem and proceeds to solve the latter using standard gradient-based approaches while simultaneously updating both actual and surrogate system states. It is shown t...

متن کامل

Stochastic Discrete Optimization Using a Surrogate Problem Methodology*

We consider stochastic discrete optimization problems where the decision variables are non-negative integers. We propose and analyze an on-line control scheme which transforms the problem into a “surrogate” continuous optimization problem and proceeds to solve the latter using standard gradient-based approaches while simultaneously updating both actual and surrogate system states. Convergence o...

متن کامل

A stochastic algorithm for online bipartite resource allocation problems

This paper deals with online resource allocation problems whereby buyers with a limited total budget want to purchase items that become available one at a time and which consume some amount of various limited resources upon allocation. Sponsored search advertising is a typical example: in order to maximize revenue, search engines try to choose the best available advertisement to display for eac...

متن کامل

Online Resource Allocation Problems∗

In this paper, we consider an online resource allocation problem, where buyers with limited budgets are interested in purchasing items that consume a limited amount of resources. In general, there is no nontrivial performance guarantee for the worst cases. However, after imposing two reasonable restrictions, we can propose two online algorithms, a greedy algorithm and a primal dual algorithm, w...

متن کامل

A Generalized ‘surrogate Problem’ Methodology for On-line Stochastic Discrete Optimization¤

We consider stochastic discrete optimization problems where the decision variables are non-negative integers and propose a generalized “surrogate problem” methodology that modi...es and extends previous work in [1]. Our approach is based on an on-line control scheme which transforms the problem into a “surrogate” continuous optimization problem and proceeds to solve the latter using standard gr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Optimization Theory and Applications

سال: 2001

ISSN: 0022-3239,1573-2878

DOI: 10.1023/a:1026490318131